The problem can be found at the following link: Question Link
To convert a Gray code to binary, we can use bitwise XOR operations. The process involves iterating through each bit of the Gray code, and at each step, XOR-ing it with the previously processed bit. This results in the binary representation of the given Gray code.
- Time Complexity :
O(log n)
, where n is the input number. - Auxiliary Space Complexity : O(1).
class Solution {
public:
int grayToBinary(int n)
{
int ans = 0;
while(n > 0)
{
ans = ans ^ n;
n = n >> 1;
}
return ans;
}
};
For discussions, questions, or doubts related to this solution, please visit our discussion section. We welcome your input and aim to foster a collaborative learning environment.
If you find this solution helpful, consider supporting us by giving a ⭐ star
to the getlost01/gfg-potd repository.